Improved linear programming methods for checking avoiding sure loss
نویسندگان
چکیده
منابع مشابه
Efficient Algorithms for Checking Avoiding Sure Loss
Sets of desirable gambles provide a general representation of uncertainty which can handle partial information in a more robust way than precise probabilities. Here we study the effectiveness of linear programming algorithms for determining whether or not a given set of desirable gambles avoids sure loss (i.e. is consistent). We also suggest improvements to these algorithms specifically for che...
متن کاملImproved Fixed Point Methods for Loss Networks with Linear Structure
This paper is concerned with the performance evaluation of loss networks. For the simplest networks there are explicit analytical formulae for the important measures of performance , but for networks which involve some level of dynamic control, exact analytical methods have had only limited success. Under several regimes the Erlang Fixed Point (EFP) method provides a good approximation for the ...
متن کاملChecking Linear Duration Invariants by Linear Programming
In this paper, the problem of verifying a timed automaton for a Duration Calculus formula in the form of linear duration invariants 2] is addressed. We show that by linear programming, a particular class of timed automata including the class of real-time automata as a proper subset, can be checked for linear duration invariants. The so-called real-time regular expressions is introduced to expre...
متن کاملChecking Strong Optimality of Interval Linear Programming
In this paper, we will discusse the strong optimality of general interval linear program (IvLP), that is, the IvLP has an optimal solution for each realization, and some necessary and sufficient conditions are established, based on the duality theory. Keywordsoptimal solution; strongly feasible; duality;
متن کاملA goal programming approach for fuzzy flexible linear programming problems
We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2018
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2018.07.013